Every circle graph of girth at least 5 is 3-colourable
نویسندگان
چکیده
منابع مشابه
Every circle graph of girth at least 5 is 3-colourable
It is known that every triangle-free (equivalently, of girth at least 4) circle graph is 5-colourable (Kostochka, 1988) and that there exist examples of these graphs which are not 4-colourable (Ageev, 1996). In this note we show that every circle graph of girth at least 5 is 2-degenerate and, consequently, not only 3-colourable but even 3-choosable.
متن کاملPlanar graphs with girth at least 5 are (3, 5)-colorable
A graph is (d1, . . . , dr )-colorable if its vertex set can be partitioned into r sets V1, . . . , Vr where themaximum degree of the graph induced by Vi is at most di for each i ∈ {1, . . . , r}. Let Gg denote the class of planar graphs with minimum cycle length at least g . We focus on graphs in G5 since for any d1 and d2, Montassier and Ochem constructed graphs in G4 that are not (d1, d2)-co...
متن کاملOn 3-choosable planar graphs of girth at least 4
Let G be a plane graph of girth at least 4. Two cycles of G are intersecting if they have at least one vertex in common. In this paper, we show that if a plane graph G has neither intersecting 4-cycles nor a 5-cycle intersecting with any 4-cycle, then G is 3-choosable, which extends one of Thomassen’s results [C. Thomassen, 3-list-coloring planar graphs of girth 5, J. Combin. Theory Ser. B 64 (...
متن کاملEvery Monotone 3-Graph Property is Testable
Let k ≥ 2 be a fixed integer and P be a property of k-uniform hypergraphs. In other words, P is a (typically infinite) family of k-uniform hypergraphs and we say a given hypergraph H satisfies P if H ∈ P . For a given constant η > 0 a k-uniform hypergraph H on n vertices is η-far from P if no hypergraph obtained from H by changing (adding or deleting) at most ηn edges in H satisfies P . More pr...
متن کاملUniquely D-colourable Digraphs with Large Girth
Let C and D be digraphs. A mapping f : V (D) → V (C) is a Ccolouring if for every arc uv of D, either f(u)f(v) is an arc of C or f(u) = f(v), and the preimage of every vertex of C induces an acyclic subdigraph in D. We say that D is C-colourable if it admits a C-colouring and that D is uniquely Ccolourable if it is surjectively C-colourable and any two C-colourings of D differ by an automorphis...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 1999
ISSN: 0012-365X
DOI: 10.1016/s0012-365x(98)00192-7